Fourier transforms on the motion groups

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A tensor product approach to the abstract partial fourier transforms over semi-direct product groups

In this article, by using a partial on locally compact semi-direct product groups, we present a compatible extension of the Fourier transform. As a consequence, we extend the fundamental theorems of Abelian Fourier transform to non-Abelian case.

متن کامل

Generating fast Fourier transforms of solvable groups

This paper presents a new algorithm for constructing a complete list of pairwise inequivalent ordinary irreducible representations of a finite solvable group G. The input of the algorithm is a pc-presentation corresponding to a composition series refining a chief series of G. Modifying the Baum-Clausen-Algorithm for supersolvable groups and combining this with an idea of Plesken for constructin...

متن کامل

Fourier Transforms of Lipschitz Functions on Certain Lie Groups

We study the order of magnitude of the Fourier transforms of certain Lipschitz functions on the special linear group of real matrices of order two. 2000 Mathematics Subject Classification. 42A38, 44A15, 42C99, 44A05.

متن کامل

Efficient Computation of Fourier Transforms on Compact Groups

This paper generalizes the fast Fourier transform algorithm to the computationof Fourier transformson compact Lie groups. The basic technique uses factorization of group elements and Gel'fand-Tsetlin bases to simplify the computations, and may be extended to treat the computation of Fourier transforms of nitely supported distributions on the group. Similar transforms may be deened on homogeneou...

متن کامل

Fast Fourier Transforms for Symmetric Groups: Theory and Implementation

Recently, it has been proved that a Fourier transform for the symmetric group S„ based on Young's seminormal form can be evaluated in less than 0.5(h3 + n2)n\ arithmetic operations. We look at this algorithm in more detail and show that it allows an efficient software implementation using appropriate data structures. We also describe a similarly efficient algorithm for the inverse Fourier trans...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Mathematical Society of Japan

سال: 1976

ISSN: 0025-5645

DOI: 10.2969/jmsj/02810018